package homework2;

import org.w3c.dom.ls.LSOutput;

public class Test {
    public static void main(String[] args) {
        Solution s = new Solution();
//        Solution.TreeNode root = s.createTree();
//        Solution.TreeNode p = s.node5;
//        Solution.TreeNode q = s.node1;
//        Solution.TreeNode common = s.lowestCommonAncestor(root, p, q);
//        System.out.println();
        Solution.TreeNode root = s.createTree2();
        s.hasPathSum(root, 0);
        System.out.println();

    }
}
